Eective Field Theories
نویسنده
چکیده
These lectures introduce some of the basic ideas of e ective eld theories. The topics discussed include: relevant and irrelevant operators and scaling, renormalization in e ective eld theories, decoupling of heavy particles, power counting, and naive dimensional analysis. E ective Lagrangians are used to study the S = 2 weak interactions and chiral perturbation theory.
منابع مشابه
Baryons as Chiral solitons in the Nambu– Jona-Lasinio model
y Supported in part by the Deutsche Forschungsgemeinschaft (DFG) under contract number Re{856/2-2. z Supported by a Habilitanden{scholarship of the Deutsche Forschungsgemeinschaft (DFG). Abstract The description of baryons as chiral solitons of the Nambu{Jona{Lasinio (NJL) model is reviewed. A motivation for the soliton description of baryons is provided from large N C QCD. Rigorous results on ...
متن کاملCdmtcs Research Report Series Eective Presentability of Boolean Algebras of Cantor{bendixson Rank 1 Eective Presentability of Boolean Algebras of Cantor{bendixson Rank 1
We show that there is a computable Boolean algebra B and a computably enumerable ideal I of B such that the quotient algebra B=I is of Cantor{Bendixson rank 1 and is not isomorphic to any computable Boolean algebra. This extends a result of L. Feiner and is deduced from Feiner's result even though Feiner's construction yields a Boolean algebra of in nite Cantor{Bendixson rank.
متن کاملSux Array 9=@.%"%k%4%j%:%'$nhf3s Sux Array $,$"$k!#$3$l$oj8;zns$na4$f$n@\hx<-$n%]%$%s%?$r<-=q=g$k3jg<$7$?g[ns$g!" Comparison among Sux Array Construction Algorithms
Sux array is a compact data structure for searching matched strings from text databases. It is an array of pointers and stores all suxes of a text in lexicographic order. Because its memory requirement is less than tree structures, it is eective for large databases. Moreover, constructing the sux array is used in the Block Sorting compression scheme. We compare algorithms for constructing sux a...
متن کاملA Multi-Grid Cluster Labeling Scheme
Number of multi-grid cycles needed to converge as a function of log 2 L for the case of bond percolation (circles) and the Ising model (squares), both at the critical point in two dimensions. The lines are 2 ts to the points. The number of congurations ranges from 100 to 1000 for the dierent values of L. 7 algorithms which have been shown to reduce critical slowing down in many dierent systems ...
متن کامل